Scheduling Tasks and Communications on a Hierarchical System with Message Contention
نویسندگان
چکیده
A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.
منابع مشابه
Communication Scheduling in Parallel Task Executions on Large Parallel Systems
Scheduling is an important issue in parallel processing. Most scheduling algorithms makes assigns tasks in a direct acyclic graph (DAG) to processors. Usually only the allocation and ordering of tasks are considered, and sometimes communication time is included in the determination of priorities of the tasks, however, communication messages are not explicitly scheduled. Moreover, communication ...
متن کاملOVOPS-an object oriented implementation framework for protocol engineering
OVOPS supports the design, implementation and prototyping of protocols and distributed applications by providing an object oriented framework with class libraries and tools that are often needed in the development of communications software. The basic structure of OVOPS is described in Fig. 1. With OVOPS, implementations can be made largely independent of the operating system. In short, the bas...
متن کامل3 Rd International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems the 24th Euromicro Conference on Real-time Systems
Hierarchical scheduling is a recent real-time scheduling topic. It is used to obtain temporal interference isolation in various scenarios, such as scheduling soft real-time aperiodic tasks along with hard real-time periodic tasks, as in mixed-criticality scenarios. Most theory and practice focuses on two-level hierarchies, with a root (global) scheduler managing resource contention by partition...
متن کاملTask-execution scheduling schemes for network measurement and monitoring
Measurement is a required process in high performance networks for efficient quality-of-service (QoS) provisioning and service verification. Active measurement is an attractive approach because the measurement traffic injected into the network can be controlled and the measurement tasks can be distributed throughout the network. However, the execution of measurement tasks in common parts of a n...
متن کاملA Genetic Algorithm Approach to Scheduling Communications for a Class of Parallel Space-Time Adaptive Processing Algorithms
An important consideration in the maximization of performance in parallel processing systems is scheduling the communication of messages during phases of data movement to reduce network contention and overall communication time. The work presented in this paper focuses on off-line optimization of message schedules for a class of radar signal processing techniques know as space-time adaptive pro...
متن کامل